An Improved Conference-Key Agreement Protocol with Forward Secrecy

نویسنده

  • Yuh-Min Tseng
چکیده

Recently, Tzeng proposed a provably secure and fault-tolerant conference-key agreement protocol. It requires only a constant number of rounds to establish a conference key among all honest participants. This article will show that Tzeng’s protocol does not offer forward secrecy. We say that a conference-key agreement protocol offers forward secrecy if the long-term secret key of any participant is compromised and will not result in the compromise of the previously established conference keys. This property is important and has been included in most key agreement protocols and standards. In this paper, an improvement based on Tzeng’s protocol is proposed and it achieves forward secrecy. Under the Diffie–Hellman decision problem assumption and the random oracle model, we show that the proposed protocol can withstand passive attacks and is secure against impersonator’s attacks. The improved protocol requires a constant number of rounds to compute a conference key. The improved protocol provides fault-tolerance.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Security Analysis of Lightweight Authentication Scheme with Key Agreement using Wireless Sensor Network for Agricultural Monitoring System

Wireless sensor networks have many applications in the real world and have been developed in various environments. But the limitations of these networks, including the limitations on the energy and processing power of the sensors, have posed many challenges to researchers. One of the major challenges is the security of these networks, and in particular the issue of authentication in the wireles...

متن کامل

Round-Optimal Contributory Conference Key Agreement

Becker and Wille derived a lower bound of only one round for multi-party contributory key agreement protocols. Up until now no protocol meeting this bound has been proven secure. We present a protocol meeting the bound and prove it is secure in Bellare and Rogaway’s model. The protocol is much more efficient than other conference key agreement protocols with provable security, but lacks forward...

متن کامل

A WTLS Handshake Protocol with User Anonymity and Forward Secrecy

Forward secrecy and user anonymity are provided in the WTLS for the wireless Internet communications. Forward secrecy can be built by using Diffie-Hellman key agreement with random numbers in the Hello messages, and user anonymity by employing the signcryption scheme to the ClientKeyExchange and CertificateVerify procedure. In addition to these features, the modified WTLS handshake protocol has...

متن کامل

Efficient Identity-based Authenticated Key Agreement Protocol with PKG Forward Secrecy

For an identity-based authenticated key agreement (IDAK) protocol, PKG forward secrecy is the strongest notion of forward secrecy, which is about the security of previously established session keys after the master secret key of the Private Key Generatior (PKG) is compromised. In this paper, we put forward a new identity-based authenticated key agreement protocol which achieves PKG forward secr...

متن کامل

Attacks on Bresson-Chevassut-Essiari-Pointcheval’s Group Key Agreement Scheme⋆

In this paper, we show that Bresson-Chevassut-Essiari-Pointcheval’s group key agreement scheme does not meet the main security properties: implicit key authentication, forward secrecy, and known key security. Also, we propose an improved version which fixes the security flaws found in the scheme.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Informatica, Lith. Acad. Sci.

دوره 16  شماره 

صفحات  -

تاریخ انتشار 2005